The generator matrix

 1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  X  X  X  0  0  0  1  1  1  1  X  X  X  0  0  0  1  1  1  1  X  0  X  0  X  0  X  1  1  1  1  X  0  X  0  X  X  0  X  X  0  X  0  X  0  1  X  1  1  1  X  X  X  X  0  0  0  1  1  X  1  1  1
 0  X  0  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  X  X  X  X  0  0  0  X  X  0  X  X  X  X  0  0  0  X  X  0  0  X  X  X  X  0  0  0  X  X  0  0  X  X  0  X  X  0  0  0  X  X  X  X  0  0  0  X  X  0  0  X  X  X  X  0  0  0  0  X  X  0
 0  0  X  X  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  0  X  X  0  X  X  0  0  X  X  0  X  X  0  X  X  0  0  X  X  0  X  X  0  X  X  X  X  0  0  0  0  X  X  0  X  X  X  X  0  0  0  0  X  X  X  X  0  0  0  0  X  X  0  0  X  X  0  0  X  X  0  X  0  X  0  0

generates a code of length 95 over Z2[X]/(X^2) who´s minimum homogenous weight is 100.

Homogenous weight enumerator: w(x)=1x^0+3x^100+8x^101+3x^102+1x^106

The gray image is a linear code over GF(2) with n=190, k=4 and d=100.
As d=100 is an upper bound for linear (190,4,2)-codes, this code is optimal over Z2[X]/(X^2) for dimension 4.
This code was found by Heurico 1.16 in 0.2 seconds.